Railway Crew Scheduling Based on Step by Step Optimization and Graph Partitioning
نویسندگان
چکیده
منابع مشابه
Two Mathematical Models for Railway Crew Scheduling Problem
Railway crew scheduling problem is a substantial part of the railway transportation planning, which aims to find the optimal combination of the trip sequences (pairings), and assign them to the crew complements. In this problem, each trip must be covered by at least one pairing. The multiple-covered trips lead to impose useless transfers called “transitions”. In this study, a new ma...
متن کاملA Comprehensive Approach for Railway Crew Scheduling Problem (Case Study: Iranian Railway Network)
The aim of this study is to propose a comprehensive approach for handling the crew scheduling problem in the railway systems. In this approach, the information of different railway trips are considered as input and the problem is divided to three separated phases. In phase I, we generate all feasible sequences of the trips, which are named as the pairings. A depth-first search algorithm is deve...
متن کاملSolving Large Scale Crew Scheduling Problems by using Iterative Partitioning
This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). NS operates about 30,000 trains a week. All these trains need a driver and a certain number of conductors. No available crew scheduling algorithm can solve such huge instances at once. A common approach to deal with these huge weekly instances, is to split them into sever...
متن کاملOptimization in railway scheduling
Train scheduling has been a significant issue in the railway industry. Over the last few years, numerous approaches and tools have been developed to aid in the management of railway infrastructure. In this paper, we describe some techniques, which was developed in a project in collaboration with the Spanish Railway Infractructure Manager (ADIF). We formulate train scheduling as constraint optim...
متن کاملCovering Step Graph
Within the framework of concurrent systems, several verii-cation approaches require as a preliminary step the complete derivation of the state space. Partial-order methods are eecient for reducing the state explosion due to the representation of parallelism by interleaving. The covering step graphs are introduced as an alternative to labelled transition systems. A transition step consists of se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 2019
ISSN: 0453-4654,1883-8189
DOI: 10.9746/sicetr.55.92